Systolic Array Technique for Determining Common Approximate Substrings
نویسندگان
چکیده
A technique using a systolic array structure is proposed for solving the common approximate substring (CAS) problem. This approach extends the technique introduced in earlier work from the computation of the edit-distance between two strings to the more encompassing CAS problem. A comparison to existing work is given, and the technique presented is validated and analyzed based on simulations.
منابع مشابه
Modifications of the Landau-Vishkin Algorithm Computing Longest Common Extensions via Suffix Arrays and Efficient RMQ computations
Approximate string matching is an important problem in Computer Science. The standard solution for this problem is an O(mn) running time and space dynamic programming algorithm for two strings of length m and n. Landau and Vishkin developed an algorithm which uses suffix trees for accelerating the computation along the dynamic programming table and reaching space and running time in O(nk), wher...
متن کاملReconfigurable Systems for Sequence Alignment and for General Dynamic Programming
Reconfigurable systolic arrays can be adapted to efficiently resolve a wide spectrum of computational problems; parallelism is naturally explored in systolic arrays and reconfigurability allows for redefinition of the interconnections and operations even during run time (dynamically). We present a reconfigurable systolic architecture that can be applied for the efficient treatment of several dy...
متن کاملApproximate solution of the stochastic Volterra integral equations via expansion method
In this paper, we present an efficient method for determining the solution of the stochastic second kind Volterra integral equations (SVIE) by using the Taylor expansion method. This method transforms the SVIE to a linear stochastic ordinary differential equation which needs specified boundary conditions. For determining boundary conditions, we use the integration technique. This technique give...
متن کاملEfficient Algorithm for δ-Approximate Jumbled Pattern Matching
The Jumbled Pattern Matching problem consists on finding substrings which can be permuted to be equal to a given pattern. Similarly the δ Approximate Jumbled Pattern Matching problem asks for substrings equivalent to a permutation of the given pattern, but allowing a vector of possible errors δ. Here we provide a new efficient solution for the δ Approximate Jumbled Pattern Matching problem usin...
متن کاملDetermining space parameters in systolic array design
This paper addresses the problem of determining geometric and chip area of systolic arrays for one class of nested loop algorithms in advance, before the systolic array synthesis. These parameters are determined only according to a given projection direction and loop boundaries.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1006.1104 شماره
صفحات -
تاریخ انتشار 2010